Feature selection using singular value decomposition and QR factorization with column pivoting for text-independent speaker identification

نویسندگان

  • Sandipan Chakroborty
  • Goutam Saha
چکیده

Selection of features is one of the important tasks in the application like Speaker Identification (SI) and other pattern recognition problems. When multiple features are extracted from the same frame of speech, it is expected that a feature vector would contain redundant features. Redundant features confuse the speaker model in multidimensional space resulting in degraded performance by the system. Careful selection of potential features can remove this redundancy while helping to achieve the higher rate of accuracy at lower computational cost. Although the selection of features is difficult without having exhaustive search, this paper proposes an alternative and straight forward technique for feature selection using Singular Value Decomposition (SVD) followed by QR Decomposition with Column Pivoting (QRcp). The idea is to capture the most salient part of the information from the speakers’ data by choosing those features that can explain different dimensions showing minimal similarities (or maximum acoustic variability) among them in orthogonal sense. The performances after selection of features using proposed criterion have been compared with using Mel-frequency Cepstral Coefficients (MFCC), Linear Frequency (LF) Cepstral Coefficients (LFCC) and a new feature proposed in this paper that is based on Gaussian shaped filters on mel-scale. It is shown that proposed SVD-QRcp based feature selection outperforms F-Ratio based method and the proposed feature extraction tool is superior to baseline MFCC & LFCC. 2010 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematics and Engineering Analysis Technical Report Boeing Information and Support Services Mea-tr-193-revised Sparse Multifrontal Rank Revealing Qr Factorization Sparse Multifrontal Rank Revealing Qr Factorization

We describe an algorithm to compute a rank revealing sparse QR factorization. We augment a basic sparse multifrontal QR factoriza-tion with an incremental condition estimator to provide an estimate of the least singular value and vector for each successive column of R. We remove a column from R as soon as the condition estimate exceeds a tolerance, using the approximate singular vector to selec...

متن کامل

QR factorization with complete pivoting and accurate computation of the SVD

A new algorithm of Demmel et al. for computing the singular value decomposition (SVD) to high relative accuracy begins by computing a rank-revealing decomposition (RRD). Demmel et al. analyse the use of Gaussian elimination with complete pivoting (GECP) for computing the RRD. We investigate the use of QR factorization with complete pivoting (that is, column pivoting together with row sorting or...

متن کامل

On Data Layout in the Parallel Block-jacobi Svd Algorithm with Pre–processing

An efficient version of the parallel two-sided block-Jacobi algorithm for the singular value decomposition of an m × n matrix A includes the pre-processing step, which consists of the QR factorization of A with column pivoting followed by the optional LQ factorization of the Rfactor. Then the iterative two-sided block-Jacobi algorithm is applied in parallel to the R-factor (or L-factor). Having...

متن کامل

Parallelization of the QR Decomposition with Column Pivoting Using Column Cyclic Distribution on Multicore and GPU Processors

The QR decomposition with column pivoting (QRP) of a matrix is widely used for rank revealing. The performance of LAPACK implementation (DGEQP3) of the Householder QRP algorithm is limited by Level 2 BLAS operations required for updating the column norms. In this paper, we propose an implementation of the QRP algorithm using a distribution of the matrix columns in a round-robin fashion for bett...

متن کامل

Solving Linear Inequalities in a Least Squares Sense

In 1980, Han 5] described a nitely terminating algorithm for solving a system Ax b of linear inequalities in a least squares sense. The algorithm requires a singular value decomposition of a submatrix of A on each iteration, making it impractical for all but the smallest problems. This paper shows that a modiication of Han's algorithm allows the iterates to be computed using QR factorization wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Speech Communication

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2010